Corrections to "Shuffled Iterative Decoding"

In the above paper [1], the second paragraph of the introduction was accidentally omitted. This paragraph and corresponding citations should appear as follows. As for iterative decoding of LDPC codes, there are two main scheduling approaches, probabilistic approaches and deterministic approaches. Although both scheduling approaches provide better complexity/performance tradeoff than their standard counterpart, the performance of probabilistic methods usually depends on additional parameters such as the received sequence or the graph structure of the code [12]–[14]. Deterministic scheduling can be implemented based on either horizontal or vertical partitioning. References [12]–[14] are repeated below.